1,479 research outputs found

    Improving Resource Efficiency with Partial Resource Muting for Future Wireless Networks

    Full text link
    We propose novel resource allocation algorithms that have the objective of finding a good tradeoff between resource reuse and interference avoidance in wireless networks. To this end, we first study properties of functions that relate the resource budget available to network elements to the optimal utility and to the optimal resource efficiency obtained by solving max-min utility optimization problems. From the asymptotic behavior of these functions, we obtain a transition point that indicates whether a network is operating in an efficient noise-limited regime or in an inefficient interference-limited regime for a given resource budget. For networks operating in the inefficient regime, we propose a novel partial resource muting scheme to improve the efficiency of the resource utilization. The framework is very general. It can be applied not only to the downlink of 4G networks, but also to 5G networks equipped with flexible duplex mechanisms. Numerical results show significant performance gains of the proposed scheme compared to the solution to the max-min utility optimization problem with full frequency reuse.Comment: 8 pages, 9 figures, to appear in WiMob 201

    The role of asymptotic functions in network optimization and feasibility studies

    Full text link
    Solutions to network optimization problems have greatly benefited from developments in nonlinear analysis, and, in particular, from developments in convex optimization. A key concept that has made convex and nonconvex analysis an important tool in science and engineering is the notion of asymptotic function, which is often hidden in many influential studies on nonlinear analysis and related fields. Therefore, we can also expect that asymptotic functions are deeply connected to many results in the wireless domain, even though they are rarely mentioned in the wireless literature. In this study, we show connections of this type. By doing so, we explain many properties of centralized and distributed solutions to wireless resource allocation problems within a unified framework, and we also generalize and unify existing approaches to feasibility analysis of network designs. In particular, we show sufficient and necessary conditions for mappings widely used in wireless communication problems (more precisely, the class of standard interference mappings) to have a fixed point. Furthermore, we derive fundamental bounds on the utility and the energy efficiency that can be achieved by solving a large family of max-min utility optimization problems in wireless networks.Comment: GlobalSIP 2017 (to appear

    Consensus Acceleration in Multiagent Systems with the Chebyshev Semi-Iterative Method

    No full text
    We consider the fundamental problem of reaching consensus in multiagent systems; an operation required in many applications such as, among others, vehicle formation and coordination, shape formation in modular robotics, distributed target tracking, and environmental modeling. To date, the consensus problem (the problem where agents have to agree on their reported values) has been typically solved with iterative decentralized algorithms based on graph Laplacians. However, the convergence of these existing consensus algorithms is often too slow for many important multiagent applications, and thus they are increasingly being combined with acceleration methods. Unfortunately, state-of-the-art acceleration techniques require parameters that can be optimally selected only if complete information about the network topology is available, which is rarely the case in practice. We address this limitation by deriving two novel acceleration methods that can deliver good performance even if little information about the network is available. The first proposed algorithm is based on the Chebyshev semi-iterative method and is optimal in a well defined sense; it maximizes the worst-case convergence speed (in the mean sense) given that only rough bounds on the extremal eigenvalues of the network matrix are available. It can be applied to systems where agents use unreliable communication links, and its computational complexity is similar to those of simple Laplacian-based methods. This algorithm requires synchronization among agents, so we also propose an asynchronous version that approximates the output of the synchronous algorithm. Mathematical analysis and numerical simulations show that the convergence speed of the proposed acceleration methods decrease gracefully in scenarios where the sole use of Laplacian-based methods is known to be impractical

    All-strain based valley filter in graphene nanoribbons using snake states

    Full text link
    A pseudo-magnetic field kink can be realized along a graphene nanoribbon using strain engineering. Electron transport along this kink is governed by snake states that are characterized by a single propagation direction. Those pseudo-magnetic fields point towards opposite directions in the K and K' valleys, leading to valley polarized snake states. In a graphene nanoribbon with armchair edges this effect results in a valley filter that is based only on strain engineering. We discuss how to maximize this valley filtering by adjusting the parameters that define the stress distribution along the graphene ribbon.Comment: 8 pages, 6 figure

    Efeito da adubação nitrogenada e do pastejo sobre a frequĂȘncia de espĂ©cies invasoras em ambientes de pastagem cultivada.

    Get PDF
    Altas doses de nitrogĂȘnio e manejo do pastejo mais intensivo tendem a diminuir a freqĂŒĂȘncia de espĂ©cies invasoras, pelo favorecimento do crescimento da espĂ©cie principal e efeito do pastejo sobre a presença de espĂ©cies invasoras de potencial forrageiro

    Estudo da divergĂȘncia genĂ©tica em linhagens brasileiras de anaplasma marginale atravĂ©s da utilização do gene da proteĂ­na principal de superfĂ­cie MSP1&#945.

    Get PDF
    Bovine anaplasmosis, caused by rickettsia Anaplasma marginale, represent one of the most important diseases ofruminants worldwide, causing significant economic losses in Brazil. This pathogen can be transmitted byRhipicephalus (Boophilus) microplus infected tick; by biting flies or by blood-contaminated fomites. The major surface proteins (msp) are involved in host-pathogen and tick-pathogen interactions and have been used as markers in A. marginale characterization and genetics studies In this study were characterized A. marginale strains obtained from naturally infected cattle from RondĂŽnia, Acre and SĂŁo Paulo State. The msp1 gene was amplified from A. marginale DNA extracted from erythrocytes by PCR in a 50 μl volume of PCR MasterMix (Promega, USA). Amplified fragments were purified and used directly for sequencing . The nucleotide and amino acid sequences of A. marginale msp1 were used for sequence alignment and genetics analysis. Multiple sequence alignment was performed using the Clustal X software. Nucleotides were coded as unordered, discrete characters with five possible character-states; A, C, G, T, or N, and gaps were coded as missing data. After a first proceeding and removal of the regions without genetic information, was carried the definitive alignment. Searches for the most parsimonious tree employed the branch and bound. The stability of the inferred topology was assessed via bootstrap analysis.. Through alignment analysis of the slighter variable region of msp1a gene, five rickettsia isolated types were identified in the A. marginale populations from SĂŁo Paulo, RondĂŽnia and Acre states. These results indicates that the strains of Acre state were less similar with SĂŁo Paulo sample and not have divergence within strains obtained of samples provide

    New molecular data attest to the absence of cospeciation patterns between Placobdella costata (Fr. MĂŒller, 1846) (Hirudinea) and freshwater turtles (Emys spp.) in Italy

    Get PDF
    The only Palearctic representative of the leech genus Placobdella Blanchard, 1893 is P. costata, an ectoparasite of freshwater turtles. To date, no conclusive evidence about the possible presence of coevolutionary patterns between this leech and its turtle hosts is available due to the paucity of DNA sequence data available for P. costata; moreover, comparative host data is also mostly lacking, making any inferences more difficult. The discovery of new populations of the species in northern Italy and Sicily allowed us to generate novel mitochondrial DNA sequences and to compare the topology of the resulting phylogenetic trees with the phylogeny of the turtle hosts occurring in the study area, i.e., Emys orbicularis and E. trinacris. The branching pattern of the phylogenetic tree for P. costata is not congruent with that of its turtle hosts, thus suggesting the lack of coevolutionary or cospeciation phenomena between these taxa. The lack of a coevolutionary pattern might be ascribed to the different dispersal ability of Placobdella costata and Emys spp. and to the host generality of the leech, as confirmed by the occurrence of P. costata on aquatic turtles belonging to the genus Mauremys in areas where Emys spp. are rare or absent. A single leech cytochrome c oxidase subunit 1 haplotype was found in each study region, and the overall nucleotide diversity was very low throughout the investigated distribution. This apparent lack of a clear phylogeographical pattern was unexpected in the P. costata populations occurring in the circum-Mediterranean areas, where the occurrence of high haplotype and nucleotide diversity is customary for most terrestrial and freshwater species. Based on the available data, we suggest a recent, post-glacial origin of the studied P. costata populations
    • 

    corecore